interactive proof systems造句

例句与造句

1. Ran Raz is well known for his work on interactive proof systems.
2. See interactive proof system # MIP for more details.
3. The main complexity classes describing interactive proof systems are "'IP " '.
4. Interactive proof systems have been found to have some important implications for traditional complexity classes defined using only one machine.
5. Another interactive proof system characterizing "'NEXPTIME "'is a certain class of probabilistically checkable proofs.
6. It's difficult to find interactive proof systems in a sentence. 用interactive proof systems造句挺难的
7. "' NEXPTIME "'often arises in the context of interactive proof systems, where there are two major characterizations of it.
8. Promise problems play an important role in several areas of computational complexity, including hardness of approximation, property testing, and interactive proof systems.
9. He also introduced Probabilistic Quantifiers and Alternations of Probabilistic Quantifiers to uniformly describe various Complexity Classes as well as Interactive Proof Systems and Probabilistic Games.
10. Rackoff was awarded the 1993 G鰀el Prize for his work on interactive proof systems and for being one of the co-inventors of zero-knowledge proofs.
11. Description : IP is a complexity class whose characterization ( based on interactive proof systems ) is quite different from the usual time / space bounded computational classes.
12. In 1993, Babai was awarded the G鰀el Prize together with Shafi Goldwasser, Silvio Micali, Shlomo Moran, and Charles Rackoff, for their papers on interactive proof systems.
13. In 1993 he shared the G鰀el Prize with L醩zl?Babai, Shafi Goldwasser, Silvio Micali, and Charles Rackoff for their work on Arthur Merlin protocols and interactive proof systems.
14. Probabilistic computation is also critical for the definition of most classes of interactive proof systems, in which the verifier machine depends on randomness to avoid being predicted and tricked by the all-powerful prover machine.
15. When the seminal result IP = PSPACE was shown ( see interactive proof system ), it was done by exhibiting an interactive proof system that could solve QBF by solving a particular arithmetization of the problem.
16. When the seminal result IP = PSPACE was shown ( see interactive proof system ), it was done by exhibiting an interactive proof system that could solve QBF by solving a particular arithmetization of the problem.
更多例句：  下一页